Logical Squares for Classical Logic Sentences
نویسندگان
چکیده
منابع مشابه
AST: New Tool for Logical Analysis of Sentences based on Transparent Intensional Logic
Logical analysis of natural language is able to extract semantic relations that follow the underlying logical formalism. Transparent Intensional Logic (TIL) has been designed to capture even high-order relations between sentence elements and systematically work with all kinds of language references, i.e. extensions, intensions and hyperintensions. In this paper, we introduce the first version o...
متن کاملLocality for Classical Logic
In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. Unlike sequent systems, they drop the restriction that rules only apply to the main connective of a formula: their rules apply anywhere deeply inside a formula. This allows to observe very clearly the symmetry ...
متن کاملBilingual Logical Analysis of Natural Language Sentences
One of the main aims of logical analysis of natural language expressions lies in the task to capture the meaning structures independently on the selected “mean of transport,” i.e. on a particular natural language used. Logical analysis should just offer a “bridge between language expressions.” In this paper, we show the preliminary results of automated bilingual logical analysis, namely the ana...
متن کاملLearning to map sentences to logical form
One of the classical goals of research in artificial intelligence is to construct systems that automatically recover the meaning of natural language text. Machine learning methods hold significant potential for addressing many of the challenges involved with these systems. This thesis presents new techniques for learning to map sentences to logical form lambda-calculus representations of their ...
متن کاملCombinatory Logic and - Calculus for Classical Logic
Since Gri n's work in 1990, classical logic has been an attractive target for extracting computational contents. However, the classical principle used in Gri n's type system is the double-negation-elimination rule, which prevents one to analyze the intuitionistic part and the purely classical part separately. By formulating a calculus with J (for the elimination rule of falsehood) and P (for Pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logica Universalis
سال: 2016
ISSN: 1661-8297,1661-8300
DOI: 10.1007/s11787-016-0148-x